1 FM3
Note: FM3 contains trees, path graphs, cycle graphs, scale-free graphs, caterpillar graphs, planar graphs, and general graphs (connected simple graphs, generated with uniform probability distribution). Nonetheless, download links to data are broken. Origin Notes: The dataset was generated by the authors of “https://doi.org/10.1007/978-3-319-53925-6_11”. graph features handled: Generic, Planar, Trees Graph features in papers: generic Originally found at: http://www.felicedeluca.com/ply/data.html (broken) Appeared in years: 2017 Type of Collection: Lost/Unavailable is it stored properly?: No must be analyzed: No In repo?: No Related to Literature - Algorithm (1) (Dataset tag relations): An Interactive Tool to Explore and Improve the Ply Number of Drawings (https://www.notion.so/An-Interactive-Tool-to-Explore-and-Improve-the-Ply-Number-of-Drawings-9141cfad08234c60a979ca207ada6a86?pvs=21) cleaned format?: No duplicate?: No link works?: No Added in paper: No Page id: b3dc638f5d7541b8b01105483c356e11 unavailable/skip: Yes Cleaned ALL data: No first look: No Related to Literature - Algorithm (Dataset tag relations) 1: An Interactive Tool to Explore and Improve the Ply Number of Drawings (../Benchmark%20sets%200cc6b5e454304aec98f3b59b1a720476/Literature%20ad87f14e7097454fb2f784e2c8a2797a/Literature%20-%20Algorithm%2012e01bfc60a84007aa7d2d34293e123d/An%20Interactive%20Tool%20to%20Explore%20and%20Improve%20the%20Ply%20b8be8d1a88824561bc30d154b8a4603e.md)
2 Body
Descriptions from Literature
From “An Experimental Study on the Ply Number of Straight-Line Drawings”:
Graph Datasets. To understand whether the experimental results are influenced by the structure of the graph we considered several graph families. All graphs are of small or medium size, expressed as the number of their vertices. In some cases, the size and the number of instances used for each graph family depends on the type of question we want to answer (see Sect. 5 for details). We used the following datasets: Trees. Generated with uniform probability distribution using Pru ̈fer sequences [28]. Planar. Connected simple planar graphs, generated with the OGDF library [6]. General. Connected simple graphs, generated with uniform probability distribution. Scale-free. Scale-free graphs, generated according to the Barabasi-Albert model [2]. Caterpillars. Each caterpillar of n vertices is generated by first creating a path (spine of the caterpillar) of length \(k\in [ \frac{n}{4} , \frac{n}{2} ]\) (randomly chosen), and attaching each remaining vertex to a randomly selected vertex of the spine. Paths, Cycles. For each desired number of vertices n, there is only one (unlabeled) path and one (unlabeled) cycle of n vertices. k-ary Trees. Rooted trees where each node has either 0 or k children. Each tree is generated by starting with a single vertex and then creating k children of a randomly selected leaf, until the desired number n of vertices is achieved. When n cannot be obtained, we use a value close to it.
From “An Interactive Tool to Explore and Improve the Ply Number of Drawings”:
FM3data contains 50 caterpillars with 250 to 450 vertices… FM3data also contains planar graphs ranging from 250 to 400 vertices and a density ranging from 1.5 to 2… The remaining subset of FM3data consists of general graphs with 250 to 450 vertices and the densities 1.5 and 2.5.
Example Figures
From “An Experimental Study on the Ply Number of Straight-Line Drawings”:
=== STOP RENDERING ===
Download links seem to be broken… 😓 in website